On intersections of interval graphs
نویسندگان
چکیده
منابع مشابه
Intersections of graphs
Let G and H be two graphs of order n. If we place copies of G and H on a common vertex set, how much or little can they be made to overlap? The aim of this paper is to provide some answers to this question, and to pose a number of related problems. Along the way, we solve a conjecture of Erdős, Goldberg, Pach and Spencer.
متن کاملTropical Intersections and Rational Functions on Graphs
This write-up is concerned with the intersections of tropical curves and their relationship to rational functions on graphs. It is based on projects for Bernd Sturmfel’s 255 course in Fall 2011, Martin Olsson’s 256B course in Spring 2012, and work with Matt Baker. Sections 2 and 3 run through previous results on tropical intersections in the transverse and non-transverse cases, respectively. Se...
متن کاملGossiping on Interval Graphs
We present an algorithm that produces a schedule of transmissions to achieve gossiping in a system where nodes are equipped with radio transceivers; diierent nodes have transceivers with diierent ranges. We assume that all the nodes are placed on a line and that all communication occurs in one dimension. Finally, unlike traditional system models for gossiping, we assume that all nodes within ra...
متن کاملBinary Interval Search: a scalable algorithm for counting interval intersections
MOTIVATION The comparison of diverse genomic datasets is fundamental to understand genome biology. Researchers must explore many large datasets of genome intervals (e.g. genes, sequence alignments) to place their experimental results in a broader context and to make new discoveries. Relationships between genomic datasets are typically measured by identifying intervals that intersect, that is, t...
متن کاملOn interval total colorings of bipartite graphs
An interval total t coloring of a graph G is a total coloring of with colors 1, such that at least one vertex or edge of is colored by color − G 2, , t ... G , 1, 2, , i i t = ... , and the edges incident to each vertex together with are colored by consecutive colors, where is the degree of the vertex in . In this paper interval total colorings of bipartite graphs are investigated. ( ) v V G ∈
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1980
ISSN: 0012-365X
DOI: 10.1016/0012-365x(80)90038-2